Travelling Salesperson Problem for dynamic systems
نویسندگان
چکیده
منابع مشابه
Travelling Salesperson Problem for Dynamic Systems
In this paper, we study the following version of the Travelling Salesperson Problem: Find the fastest closed trajectory for a controlled dynamic system such that its output visits all points in a given (finite) set. We present an algorithm that, if the n points are randomly sampled from a uniform distribution, produces an output trajectory the expected duration of which scales within a constant...
متن کاملWeb-Based Implementation of Travelling Salesperson Problem Using Genetic Algorithm
The world is connected through the Internet. As the abundance of Internet users connected into the Web and the popularity of cloud computing research, the need of Artificial Intelligence (AI) is demanding. In this research, Genetic Algorithm (GA) as AI optimization method through natural selection and genetic evolution is utilized. There are many applications of GA such as web mining, load bala...
متن کاملA Task and Motion Planning Algorithm for the Dubins Travelling Salesperson Problem
A new motion planning algorithm for the so-called Dubins Travelling Salesperson Problem is derived, and compared via simulations with a number of existing algorithms from the literature. In its general form, the new algorithm is dubbed “k-step look-ahead algorithm” and stems naturally from the formulation of the Dubins Travelling Salesperson Problem as a minimum-time control problem. When the m...
متن کاملThe Backbone of the Travelling Salesperson
We study the backbone of the travelling salesperson optimization problem. We prove that it is intractable to approximate the backbone with any performance guarantee, assuming that P6=NP and there is a limit on the number of edges falsely returned. Nevertheless, in practice, it appears that much of the backbone is present in close to optimal solutions. We can therefore often find much of the bac...
متن کاملSpatial and contextual factors in human performance on the travelling salesperson problem.
The travelling salesperson problem (TSP) provides a realistic and practical example of a visuo-spatial problem-solving task. In previous research, we have found that the quality of solutions produced by human participants for small TSPs compares well with solutions from a range of computer algorithms. We have proposed that the ability of participants to find solutions reflects the natural prope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2008
ISSN: 1474-6670
DOI: 10.3182/20080706-5-kr-1001.02256